A 2-approximation algorithm for genome rearrangements by reversals and transpositions
نویسندگان
چکیده
منابع مشابه
A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions
Recently, a new approach to analyze genomes evolving was proposed which is based on comparison of gene orders versus traditional comparison of DNA sequences (Sanko et al, 1992). The approach is based on the global rearrangements (e.g., inversions and transpositions of fragments). Analysis of genomes evolving by inversions and transpositions leads to a combinatorial problem of sorting by reversa...
متن کاملApproximation Algorithm for Sorting by Reversals and Transpositions
Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a combinatorial problem of sorting by reversals and transpositions, the problem of finding a shortest sequence of reversals and transpositions that sorts one genome into the other. In this paper we present a (4 − 2 k )-approximat...
متن کاملGenome rearrangements , sorting by reversals
When comparing genomes in different species, a piece of chromosome in one species can be moved or copied to a different location in another species. Therefore, we talk about genome rearragements. So far we used alignment algorithms to compare two sequences, possibly coming from different species, but alignments do not capture all genome rearragements. An alignment of two sequences determines a ...
متن کامل(1+ε)-approximation of Sorting by Reversals and Transpositions
This paper is concerned with the problem of sorting permutations using long range operations like inversions (reversing a segment) and transpositions (moving a segment). The problem comes from computational molecular biology, where the aim is to find a parsimonious rearrangement scenario that explains the difference in gene order between two genomes. In the late eighties, Palmer and Herbon [15]...
متن کاملGenome Rearrangements and Sorting by Reversals
Sequence comparison in molecular biology is in the beginning of a major paradigm shift a shift from gene comparison based on local mutations to chromosome comparison based on global rearrangements. In the simplest f o r m the problem of gene rearrangements corresponds to sorting by reversals, i.e. sorting of an array using reversals of arbitrary fragments. Kececioglu and Sankoff gave the first ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00092-9